Techniques for quick access channel information loading in wireless networks

ABSTRACT

An embodiment of the present invention provides a method of quick access channel information loading in wireless networks, comprising mapping at least one quick access channel to one distributed resource unit of control tiles, said control tiles being spread across consecutive sub-carriers and consecutive OFDMA symbols, wherein each control tile and a predetermined number of sub carriers are used to send a bandwidth indicator and a predetermined number of sub carriers are used to send a bandwidth request message, and wherein there exist unique orthogonal sequences for the bandwidth indicator and each of the sequences are capable of being selected as a preamble sequence.

BACKGROUND

In wireless communications systems, when schedule based access is usedto allocate physical radio resources to mobile stations (MSs), thescheduler at the base station (BS) requires some critical information.For example, an uplink scheduler needs to know which MS needs PHYresources and how much and how urgent the MS needs the PHY resources.For another example, a downlink scheduler may need to know whichmodulation and code rate should be applied to the PHY resources forsending data to an MS. Such systems include present and future Institutefor Electrical and Electronic Engineers (IEEE) 802.16e, LTE and 802.16mstandards.

In the uplink (UL), one mechanism is needed for the MS to send to itsserving BS both bandwidth request (BWREQ) indicators and BWREQinformation to describe how the data should be scheduled to its servingBS. Previously, (e.g. IEEE802.16e or LTE) a MS sends the bandwidthindicator first and if the indicator is captured by the BS, in the nextstep the BS may grant PHY resources for the MS to send the bandwidthrequest. In LTE, an UL bandwidth request indicator (or schedule requestin LTE terminology) is sent in a periodically allocated PHY resource(refer to as polling hereafter).

Polling has a major drawback when the bandwidth request rate is low. Forexample, in a typical Voice over Internet Protocol (VoIP) case, 0.4BWREQ/user/second is needed to tell the BS a UL talk spurt starts. Inorder to meet the delay requirement within 5 ms, a MS needs to have oneperiodical PHY resource every 5 ms no matter if it has a bandwidthrequest to send or not. Another drawback is the large latency. Namely,the bandwidth request is sent after receiving a correct bandwidthindicator capture and successful PHY resources allocation for thebandwidth request.

Thus, a strong need exists for techniques for quick access channelinformation loading in wireless networks.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter regarded as the invention is particularly pointed outand distinctly claimed in the concluding portion of the specification.The invention, however, both as to organization and method of operation,together with objects, features, and advantages thereof, may best beunderstood by reference to the following detailed description when readwith the accompanying drawings in which:

FIG. 1 depicts a quick access channel PHY structure according to anembodiment of the present invention; and

FIG. 2. illustrates a BS ordered quick feedback procedure according toembodiments of the present invention.

It will be appreciated that for simplicity and clarity of illustration,elements illustrated in the figures have not necessarily been drawn toscale. For example, the dimensions of some of the elements areexaggerated relative to other elements for clarity. Further, whereconsidered appropriate, reference numerals have been repeated among thefigures to indicate corresponding or analogous elements.

DETAILED DESCRIPTION

In the following detailed description, numerous specific details are setforth in order to provide a thorough understanding of the invention.However, it will be understood by those skilled in the art that thepreset invention may be practiced without these specific details. Inother instances, well-known methods, procedures, components and circuitshave not been described in detail so as not to obscure the presentinvention.

Although embodiments of the invention are not limited in this regard,discussions utilizing terms such as, for example, “processing,”“computing,” “calculating,” “determining,” “establishing”, “analyzing”,“checking”, or the like, may refer to operation(s) and/or process(es) ofa computer, a computing platform, a computing system, or otherelectronic computing device, that manipulate and/or transform datarepresented as physical (e.g., electronic) quantities within thecomputer's registers and/or memories into other data similarlyrepresented as physical quantities within the computer's registersand/or memories or other information storage medium that may storeinstructions to perform operations and/or processes.

Although embodiments of the invention are not limited in this regard,the terms “plurality” and “a plurality” as used herein may include, forexample, “multiple” or “two or more”. The terms “plurality” or “aplurality” may be used throughout the specification to describe two ormore components, devices, elements, units, parameters, or the like. Forexample, “a plurality of stations” may include two or more stations.

Embodiments of the present invention provide preamble sequence selectionmethods for quick channel access that can evenly distributed users amongall sequences while also avoiding sequence collision. Embodiments of thepresent invention provide a quick 3-step access concept to IEEE802.16m,although the present invention is not limited in this respect.Embodiments of the present invention may be implemented as showngenerally as 100 of FIG. 1 as follows:

1) One quick access channel will be mapped to one distributed resourceunit that consists of three 6×6 control tiles 110, 120 and 130. The 6×6tile spreads across 6 consecutive sub-carriers and 6 consecutive OFDMAsymbols.

2) Each 6×6 control tile 110, 120 and 130 and 19 sub carriers may beused to send bandwidth indicators and 17 sub carriers may be used tosend bandwidth request messages.

3) There exist L (one example is 24) unique orthogonal sequences for thebandwidth indicator. Each of the L sequences may be selected as apreamble sequence.

4) The bandwidth message is able to carry N information bits. N is 12 bydefault, although the present invention is not limited to this.

5) In total, one bandwidth request channel is able to carry L×2^(N)unique code words.

When quick access channel is used for bandwidth request purposes, bothMS address and signaling bits will be mapped to the total available codewords. Below defines the general framework of information elementloading.

1) In total M users can be loaded to one channel, M full MAC Ids are{Id₀, Id₁, Id₂, . . . , Id_(M−1)};

2) One channel has K unique PHY address {Ar₀, Ar₁, Ar₂, . . . ,Ar_(K−1)} M≦K;

3) One channel has L unique orthogonal sequence indexes {0, 1, 2, . . .18},

4) Mapping from MAC Id to PHY address is unique for any given time t,t=0, 1, . . . ; and

5) At time t, one user can convey one code word out of J code words forsignaling satisfying J×K=L×2^(N) (i.e., the total effective informationbits that one transmission coveys is N+log₂(L) bits). It is noted thatnumber of information code words to be loaded equals to number ofinformation code words that could be conveyed by preamble and message.

When two MSs access the quick access channel at the same time and selectthe same preamble sequence, collision happens. Generally the informationloading algorithm should distribute the sequence collision probabilityequally among all L sequences. In addition, the information loadingalgorithm should also ensure if two MSs select the same sequence fortime t, the probability they select the same sequence for time t+1 islow. This prevents the sequence collision from repeating over time. Iftwo MSs access the channel at the same time, the chance that both MSsselect the same sequence should be designed to be up bounded by 1/L.

There are multiple methods to load the information to all available codewords. Some examples are listed below, but the present invention is notlimited to these examples.

The first method is described in this paragraph. If J=L×2^(O), K=2^(P),O+P=N, O≧0,P≧0, this method loads PHY address in message part and loadsignaling bits in preamble and message. If MS m wants to conveysignaling code word j at time t, p=f(j, t) is the chosen preamble index,where p=0, 1, . . . 18. f(j, t) should be designed that the probabilityP{p=i} is close to 1/L for all users. And if two MSs m₁ and m₂ want toconvey signaling code word j₁ and j₂ respectively at time t and theselected preamble sequence index is the same f(j₁, t)=f(j₂, t), weshould minimize the possibility for f(j₁, t+1)=f(j₂, t+1). A possibledrawback for this method is that f(j, t) can cause a collision increaseif the J signaling code words are not equally distributed. This exampleproposes to group preamble sequences according to service class.

The second method is described in this paragraph. If J=2^(O), K=L×2^(P),O+P=N, O≧0,P≧0, this method loads PHY address in preamble and part ofthe message and load signaling bits in rest part of the message and ifMS m wants to convey signaling CW j at time t p=h(m, t) is the chosenpreamble index, where p=0, 1, . . . L−1. h(m, t) has a much easierdesign compared with case 1 in order to make P{p=i} close to 1/L for allusers and if two users m₁ and m₂, h(m1, t)=h(m2, t), we should minimizethe possibility h(m₁, t+1)=h(m₂, t+1). A drawback for this method isthat BS may need to perform exhaustive search, i.e., calculating h(m,t), among for all possible m values at a given time t, and look up theunique valid m value or determine a collision when multiple m valuesgenerate the same output.

The third method is described in this paragraph. The third method loadsPHY address in message and load signaling bits in preamble and message.We will choose preamble index by both signaling bits and PHY address. IfJ=L×2^(O), K=2^(P), O+P=N, O≧0,P≧0, if user m wants to convey signalingCW j at time t. p=f(m, j, t) is the chosen preamble index, where p=0, 1,. . . L−1. f(m, j, t) is designed to make P{p=i} close to 1/L for allusers and if for two users m₁ and m₂, f(m₁, j₁, t)=f(m₂, j₂, t), weshould minimize the possibility f(m₁, j₁, t+1)=f(m₂, j₂, t+1).

The third method can be viewed as a hybrid method for method 1 andmethod 2, the collision probability is better than method 1 but worsethan method 2, but BS doesn't need to calculate all h(m,t) as in method2. In addition, since PHY address will be known before signaling messageis fully decoded from preamble and msg, the BS and the MS can useadditional synchronized state information shared between them as inputto function f( ) to enhance the randomness of its outputs. One exampleof such state information is the security context. Another example isthe history of output p previously successfully processed.

Below gives one example of f(m,j,t) to fulfill the design requirement.The final equation is not limited to this as long as the requirement isfulfilled. Assume f(m,j,t) mod(mod(j,L)+mod(m, L)+mod(floor(m/L)×t,L),L), At the receiver, both the preamble sequence and the messages aresuccessfully detected, such that i) m and ii) j's partial signalinginformation loaded in message are known through message and iii)p=f(m,j,t) is known through detected sequence index. We can recovermod(j,L) (which is part of j's signaling information loaded in preamble)firstly given m and p=f(m,j,t); combine it with floor(j/L) which isequivalent to the already decoded signaling bits in the message part,and therefore fully recover j. It is noted that there is no dedicatedprocedure to load one MS to one preamble; it is simply achieved byallocating a unique MAC ID to the MS. The load on every sequence iscontrollable to the BS. For example, if there are L users per sector intotal, the collision can never happen if the BS allocates MAC ID 0 toL−1. The BS may also request one or more MSs to send in feedback usingthe QACH channel. There is no need to send an MS id since it is known bythe BS. Then one bit is needed in the message bits to differentiatequick access and quick feedback. The BS ordered quick feedback procedureis illustrated generally as 200 of FIG. 2 with BS 230 and MS 240 and BSorder 210 and quick feedback 220.

The major benefit is coming from that the load of one quick accesschannel is controllable and predictable. When the load is low, using thequick access channel to send small amount of signaling bits will savePHY resources for data traffic. Further, there may be many BS initiatedMS signaling feedbacks. Many of them happen infrequently and can beencoded using a small number of code words. One example is event drivenCQI to assist the scheduling for persistent scheduling. Another examplecould be MS power headroom reporting. When ordering feedback frommultiple MSs at the same time, the BS knows beforehand which MS can usewhich preamble to send quick feedback. So there is no confusing at theBS side on who has sent the ordered quick feedback.

The information element defining for BS ordered quick feedback can befurther related to the information element in the BS order.

While certain features of the invention have been illustrated anddescribed herein, many modifications, substitutions, changes, andequivalents may occur to those skilled in the art. It is, therefore, tobe understood that the appended claims are intended to cover all suchmodifications and changes as fall within the true spirit of theinvention.

1. A method of channel information loading in wireless networks,comprising: mapping by a wireless station at least physical channel toone distributed resource unit of control tiles, said control tiles beingspread across consecutive sub-carriers and consecutive OFDMA symbols;wherein each control tile and a predetermined number of sub carriers areused to send a bandwidth indicator and a predetermined number of subcarriers are used to send a bandwidth request message; and wherein thereexist unique orthogonal sequences for said bandwidth indicator and eachof said sequences are capable of being selected as a preamble sequence.2. The method of claim 1, wherein said bandwidth request message isadapted to carry N information bits.
 3. The method of claim 1, whereinin total one bandwidth request channel is adapted to carry L×2^(N)unique code words.
 4. The method of claim 3, wherein said bandwidthrequest channel is used for bandwidth request purposes and both MSaddress and signaling bits are mapped to total available code words. 5.The method of claim 4, wherein said control tiles are three 6×6 controltiles and each of said 6×6 tile spreads across 6 consecutive subcarriers and 6 consecutive OFDMA symbols.
 6. The method of claim 5,wherein in each of said 6×6 control tiles, L sub carriers are used tosend bandwidth indicators and 17 sub carriers are used to send bandwidthrequest messages.
 7. The method of claim 6, wherein there exist L uniqueorthogonal sequences for said bandwidth indicator and each of said Lsequences are selected as a preamble sequence.
 8. The method of claim 1,wherein said wireless network is a wireless network operable tocommunicate according the IEEE 802.16 standard.
 9. The method of claim1, wherein the framework of information element loading is asfollows: 1) In total M users are loaded to one QACH, M full MAC Ids are{Id₀, Id₁, Id₂, . . . , Id_(M−1)}; 2) One channel has K unique PHYaddress {Ar₀, Ar₁, Ar₂, . . . , Ar_(K−1)} M≦K; 3) One channel has Lunique orthogonal sequence indexes {0, 1, 2, . . . L−1}; 4) Mapping fromMAC Id to PHY address is unique for any given time t, t=0, 1, . . . ;and 5) At time t, one user can convey one code word out of J code wordsfor signaling, where J×K=L×2^(N).
 10. The method of claim 9, whereinsaid information loading distributes sequence collision probabilityequally among all said L sequences and ensures if two MSs select a samesequence for time t, the probability they select the same sequence fortime t+1 is low, thereby preventing sequence collision from repeatingover time, and if two MSs access a channel at the same time, the chancethat both MSs selecting the same sequence is up bounded by 1/L.
 11. Themethod of claim 10, wherein said information loading method is selectedfrom the group consisting of: if J=L×2^(O), K=2^(P), O+P=N, O≧0, P≧0,Load PHY address in message and load signaling bits in preamble andmessage and if MS m wants to convey signaling code word j at time t,p=f(j, t) is the chosen preamble index, p=0, 1, . . . L−1, f(j, t),P{p=i} is close to 1/L for all users and if for two MSs m₁ and m₂, f(j₁,t)=f(j₂, t), we should minimize the possibility f(j₁, t+1)=f(j₂, t+1);if J=2^(O), K=L×2^(P), O+P=N, O≧0,P≧0, load PHY address in preamble andmessage and load signaling bits in message and if MS m wants to conveysignaling CW j at time t, p=h(m, t) is the chosen preamble index, wherep=0, 1, . . . L−1. h(m, t) has a much easier design compared with method1 in order to make P{p=i} close to 1/L for all users and if for twousers m₁ and m₂, h(m₁, t)=h(m₂, t), we should minimize the possibilityh(m1, t+1)=h(m2, t+1) or load PHY address in message and load signalingbits in preamble and message; choose preamble index by both signalingand PHY address, J=L×2^(O), K=2^(P), O+P=N, O≧0, P≧0, if user m wants toconvey signaling CW j at time t, then p=f(m, j, t) is the chosenpreamble index, where p=0, 1, . . . L−1. we should design f(m, j, t) tomake P{p=i} close to 1/L for all users and if for two users m₁ and m₂,f(m₁, j₁, t)=f(m₂, j₂, t), we should minimize the possibility f(m₁, j₁,t+1)=f(m₂, j₂, t+1). One example of f(m,j,t) is thatf(m,j,t)=mod(mod(j,L)+mod(m, L)+mod(floor(m/L)×t,L), L).
 12. Anapparatus adapted to provide channel information loading in wirelessnetworks, comprising: a transceiver adapted to map at least one physicalchannel to one distributed resource unit of control tiles, said controltiles being spread across consecutive sub-carriers and consecutive OFDMAsymbols; wherein each control tile and a predetermined number of subcarriers are used to send a bandwidth indicator and a predeterminednumber of sub carriers are used to send a bandwidth request message; andwherein there exist unique orthogonal sequences for said bandwidthindicator and each of said sequences are capable of being selected as apreamble sequence.
 13. The apparatus of claim 12, wherein said bandwidthrequest message is adapted to carry N information bits.
 14. Theapparatus of claim 12, wherein in total one bandwidth request channel isadapted to carry L×2^(N) unique code words.
 15. The apparatus of claim14, wherein said quick access channel is used for bandwidth requestpurposes and both MS address and signaling bits are mapped to totalavailable code words.
 16. The apparatus of claim 15, wherein saidcontrol tiles are three 6×6 control tiles and each of said 6×6 tilespreads across 6 consecutive sub carriers and 6 consecutive OFDMAsymbols.
 17. The apparatus of claim 16, wherein in each of said 6×6control tiles, L sub carriers are used to send bandwidth indicators and17 sub carriers are used to send bandwidth request messages.
 18. Theapparatus of claim 17, wherein there exist L unique orthogonal sequencesfor said bandwidth indicator and each of said L sequences are selectedas a preamble sequence.
 19. The apparatus of claim 12, wherein saidwireless network is a wireless network operable to communicate accordingthe IEEE 802.16 standard.
 20. The apparatus of claim 12, wherein theframework of information element loading is as follows: 1) In total Musers are loaded to one QACH, M full MAC Ids are {Id₀, Id₁,Id₂, . . . ,Id_(M−1)}; 2) One channel has K unique PHY address {Ar₀, Ar₁, Ar₂, . . ., Ar_(K−1)} M≦K; 3) One channel has L unique orthogonal sequence indexes{0, 1, 2, . . . L−1}; 4) Mapping from MAC Id to PHY address is uniquefor any given time t, t=0, 1, . . . ; and 5) At time t, one user canconvey one CW out of J CW for signaling, J×K=L×2^(N).
 21. The apparatusof claim 20, wherein said information loading distributes sequencecollision probability equally among all said L sequences and ensures iftwo MSs select a same sequence for time t, the probability they selectthe same sequence for time t+1 is low, thereby preventing sequencecollision from repeating over time, and if two MSs access a channel atthe same time, the chance that both MSs selecting the same sequence isup bounded by 1/L.
 22. The apparatus of claim 21, wherein saidinformation loading method is selected from the group consisting of: ifJ=L×2^(O), K=2^(P), O+P=N, O≧0, P≧0, Load PHY address in message andload signaling bits in preamble and message and if MS m wants to conveysignaling code word j at time t, p=f(j, t) is the chosen preamble index,p=0, 1, . . . L−1, f(j, t), P{p=i} is close to 1/L for all users and iffor two MSs m₁ and m₂, if f(j₁, t)=f(j₂, t), we should minimize thepossibility f(j₁, t+1)=f(j₂, t+1); if J=2^(O), K=L×2^(P), O+P=N, O≧0,P≧0, load PHY address in preamble and message and load signaling bits inmessage and if MS m wants to convey signaling CW j at time t. p=h(m, t)is the chosen preamble index, where p=0, 1, . . . L−1. h(m, t) has amuch easier design compared with method 1 in order to make P{p=i} closeto 1/L for all users and if for two users m₁ and m₂, if h(m₁, t)=h(m₂,t), we should minimize the possibility h(m1, t+1)=h(m2, t+1); or loadPHY address in message and load signaling bits in preamble and message;choose preamble index by both signaling and PHY address, J=L×2^(O),K=2^(P), O+P=N, O≧0, P≧0, if user m wants to convey signaling CW j attime t. if p=f(m, j, t) is the chosen preamble index, where p=0, 1, . .. L−1. We should design f(m, j, t) to make P{p=i} close to 1/L for allusers and if for two users m₁ and m₂ that f(m₁, j₁, t)=f(m₂, j₂, t), weshould minimize the possibility f(m₁, j₁, t+1)=f(m₂, j₂, t+1). Oneexample of f(m,j,t) is that f(m,j,t)=mod(mod(j,L)+mod(m,L)+mod(floor(m/L)×t,L), L).
 23. A machine-accessible medium thatprovides instructions, which when accessed, cause a machine to performoperations comprising: controlling channel information loading inwireless networks by mapping at least one physical channel to onedistributed resource unit of control tiles, said control tiles beingspread across consecutive sub-carriers and consecutive OFDMA symbols;wherein each control tile and a predetermined number of sub carriers areused to send a bandwidth indicator and a predetermined number of subcarriers are used to send a bandwidth request message; and wherein thereexist unique orthogonal sequences for said bandwidth indicator and eachof said sequences are capable of being selected as a preamble sequence.24. The machine-accessible medium of claim 23, wherein said bandwidthrequest message is adapted to carry N information bits.
 25. Themachine-accessible medium of claim 23, wherein in total one bandwidthrequest channel is adapted to carry L×2^(N) unique code words.
 26. Themachine-accessible medium of claim 25, wherein said quick access channelis used for bandwidth request purposes and both MS address and signalingbits are mapped to total available code words.
 27. Themachine-accessible medium of claim 26, wherein said control tiles arethree 6×6 control tiles and each of said 6×6 tile spreads across 6consecutive sub carriers and 6 consecutive OFDMA symbols.
 28. Themachine-accessible medium of claim 27, wherein in each of said 6×6control tiles, 19 sub carriers are used to send bandwidth indicators and17 sub carriers are used to send bandwidth request messages.